A Proposed Algorithm to improve security & Efficiency of SSL-TLS servers using Batch RSA decryption

Today, Internet becomes the essential part of our lives. Over 90% of the e-commerce is developed on the Internet. A security algorithm became very necessary for producer-client transactions assurance and the financial applications safety (credit cards, etc.) The RSA algorithm applicability derives from algorithm properties like: confidentiality, safe authentication, data safety and integrity on the internet. Thus, this kind of networks can have a more easy utilization by practical accessing from short, medium, even long distance and from different public places (Internet Cafe, airports, banks, commercial centers, educational institutes, etc.) the immensity of resources offered by internet. RSA encryption in the client side is relatively cheap, whereas, the corresponding decryption in the server side is expensive because its private exponent is much larger. Thus SSL/TLS servers become swamped to perform public key decryption operations when the simultaneous requests increase quickly .The Batch RSA method is useful for such highly loaded web server .In our proposed algorithm by reducing the response time & client’s tolerable waiting time an improvement in performance of SSL-TLS servers can be done. The proposed algorithm should provide the reasonable response time and optimizes server performance significantly. At Encryption side, to withstand many attacks like brute force attack, subtle attack etc. we also adapted a parameter generation method, which sieve all the parameters strictly, and filter out every insecure parameter. KeywordsBatch RSA, MiniBatching, Tolerable waiting time, response time.